package com.zhangxiaofanfan.hotcode.first;

/**
 * <a href="https://leetcode.cn/problems/next-permutation/description/?envType=study-plan-v2&envId=top-100-liked">31. 下一个排列</a>
 *
 * @date 2024-07-13 03:14:13
 * @author zhangxiaofanfan
 */
public class HotCode099 {
    public static void main(String[] args) {
        HotCode099 hotCode = new HotCode099();
        int[] nums = new int[10];
        hotCode.nextPermutation(nums);
    }

    public void nextPermutation(int[] nums) {

    }
}